Magnetization Performance of LDPC Reduced-Complexity Decoding Algorithms
نویسندگان
چکیده
منابع مشابه
Magnetization Performance of LDPC Reduced-Complexity Decoding Algorithms
Low-density parity-check (LDPC) codes are very efficient for communicating reliably through a noisy channel. N.Sourlas [1] showed that LDPC codes, which revolutionize the codes domain and used in many communications standards, can be mapped onto an Ising spin systems. Besides, it has been shown that the Belief-Propagation (BP) algorithm, the LDPC codes decoding algorithm, is equivalent to the T...
متن کاملAlgorithms and Architectures for Reduced Complexity LDPC Decoding: A survey
Low-density parity-check (LDPC) code, have become most popular, promising near-optimal error correction code (ECC). Trade off between the performance and complexity of LDPC decoders is of paramount interest to communication engineers and researchers. The VLSI implementation of LDPC decoder is a big challenge. VLSI implementations has many difficulties to achieve as lower error floors, reduced i...
متن کاملReduced Complexity LDPC Decoding using Forced Convergence
Low-density parity-check (LDPC) codes have recently emerged as a viable option for forward error correction (FEC) in future wireless communications systems. One factor influencing the decision of whether to use a specific FEC technique in a system is its suitability for real time systems – and hence, its computational complexity. In this paper, we present a novel LDPC decoding architecture, whe...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2010
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2010.36073